An Approach for Formal Verification of Updated Java Bytecode Programs
نویسندگان
چکیده
Razika Lounas University of M’hamed Bougara of Boumerdes Facutly of Sciences, LIMOSE Laboratory Avenue de l’independance, 35000 Boumerdes Algeria University of Limoges 123 Avenue Albert Thomas, 87700 Limoges, France razika [email protected] Mohamed Mezghiche University of M’hamed Bougara of Boumerdes Facutly of Sciences, LIMOSE Laboratory Avenue de l’independance, 35000 Boumerdes Algeria [email protected]
منابع مشابه
Algebraic Compilation of Safety-Critical Java Bytecode
Safety-Critical Java (SCJ) is a version of Java that facilitates the development of certifiable programs, and requires a specialised virtual machine (SCJVM). In spite of the nature of the applications for which SCJ is designed, none of the SCJVMs are verified. In this paper, we contribute a formal specification of a bytecode interpreter for SCJ and an algebraic compilation strategy from Java by...
متن کاملTowards Verification of Java Bytecode using Logic Programming Tools
State of the art analyzers in the (Constraint) Logic Programming paradigm (or (C)LP for short) are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, run-time error freeness, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verificatio...
متن کاملJava bytecode Verification using Analysis and Transformation of Logic Programs
State of the art analyzers in the (Constraint) Logic Programming paradigm (or (C)LP for short) are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, run-time error freeness, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verificatio...
متن کاملTowards Verification of Software Product Lines: The JBook Case Study
Scaling verification to large programs is a long-standing problem. There is a growing community of researchers that believe verification must be intimately integrated with software design and modularity for scaling to occur; verification of programs should not be an after-thought. In this presentation, we explore an approach that suggests how feature modularization can scale verification to pro...
متن کاملCertificates and Separation Logic
Modular and local reasoning about object-oriented programs has been widely studied for programing languages such as C# and Java. Once source programs have been proven, the next verification challenge is to ensure that the code produced by the compiler is correct. Since verifying a compiler can be extremely complex, this paper uses proof-transforming compilation, an alternative approach which au...
متن کامل